A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
نویسنده
چکیده
This paper presents the first polynomial time algorithm to compute geodesics in a CAT(0) cubical complex in general dimension. The algorithm is a simple iterative method to update breakpoints of a path joining two points using Owen and Provan’s algorithm (2011) as a subroutine. Our algorithm is applicable to any CAT(0) space in which geodesics between two close points can be computed, not limited to CAT(0) cubical complexes.
منابع مشابه
Geodesics in CAT(0) Cubical Complexes
We describe an algorithm to compute the geodesics in an arbitrary CAT(0) cubical complex. A key tool is a correspondence between cubical complexes of global non-positive curvature and posets with inconsistent pairs. This correspondence also gives an explicit realization of such a complex as the state complex of a reconfigurable system, and a way to embed any interval in the integer lattice cubi...
متن کاملThe Tits Alternative for Cat(0) Cubical Complexes
We prove a Tits alternative theorem for groups acting on CAT(0) cubical complexes. Namely, suppose that G is a group for which there is a bound on the orders of its finite subgroups. We prove that if G acts properly on a finitedimensional CAT(0) cubical complex, then either G contains a free subgroup of rank 2 or G is finitely generated and virtually abelian. In particular the above conclusion ...
متن کاملActions of Picture Groups on CAT(0) Cubical Complexes
A class of groups, called picture groups, is defined. Richard Thompson’s groups F , T , and V are all picture groups. Each picture group is shown to act properly and isometrically on a CAT(0) cubical complex. In particular, all picture groups are a-T-menable. Mathematics Subject Classifications (2000). 20F65, 43A15.
متن کاملCAT(0) cubical complexes for graph products of finitely generated abelian groups
We construct for every graph product of finitely generated abelian groups a CAT(0) cubical complex on which it acts properly and cocompactly. The complex generalizes (up to subdivision) the Salvetti complex of a right-angled Artin group and the Coxeter complex of a right-angled Coxeter group.
متن کاملA Proof of Sageev’s Theorem on Hyperplanes in Cat(0) Cubical Complexes
We prove that any hyperplane H in a CAT(0) cubical complex X has no self-intersections and separates X into two convex complementary components. These facts were originally proved by Sageev. Our argument shows that his theorem (or this direction of his theorem) is a corollary of Gromov’s link condition. We also give new arguments establishing some combinatorial properties of hyperplanes. We sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1710.09932 شماره
صفحات -
تاریخ انتشار 2017